On Fixed-Parameter Tractability and Approximability of NP Optimization Problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems

In this paper, we present a survey of the approximability and fixed-parameter tractability results for some Exemplar Genomic Distance problems. We mainly focus on three problems: the exemplar breakpoint distance problem and its complement (i.e., the exemplar non-breaking similarity or the exemplar adjacency number problem), and the maximal strip recovery (MSR) problem. The following results hol...

متن کامل

Fixed Parameter Tractability and Treewidth 14 . 1 Fixed Parameter Tractability

One of the ways to cope with hard problems in practice is to realized that problem instances may be associated with some “parameters” related to their complexity. If the parameter of an instance is small, we might have some hope in finding a polynomial time solution to that instance. This idea has been investigated in the 1990’s by Downian and Fellowes in their work on fixed parameter tractabil...

متن کامل

On the fixed-parameter tractability of parameterized model-checking problems

In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be more widely applied.

متن کامل

On Fixed-Parameter Tractability of Some Routing Problems

Disjoint Paths is the problem of finding paths between given pairs of terminals in a graph such that no vertices are shared between paths. We analyze fixed-parameter tractability of several new Disjoint Paths-like routing problems motivated by congestion control in computer networks. In one model we are interested in finding paths between k pairs of terminals such that the first edge of each pa...

متن کامل

Fixed parameter approximability and inapproximability

NP -hard problems are believed to be intractable. This is the widely believe assumption that P 6= NP . In parameterized complexity the input is refined to (I, k) with k a parameter depending on the input and the goal is to find an exact algorithm that runs in time f(k) ·nO(1) for the problem so that f is an arbitrary function. In this draft we only focus on k that is the size of the optimum sol...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 1997

ISSN: 0022-0000

DOI: 10.1006/jcss.1997.1490